This paper presents the design and performance evaluation of a reduced complexity algorithm for timing\nsynchronization. The complexity reduction is obtained via the introduction of approximate computing, which\nlightens the computational load of the algorithm with a minimal loss in precision. Timing synchronization for\nwideband-code division multiple access (W-CDMA) systems is utilized as the case study and experimental results\nshow that the proposed approach is able to deliver performance similar to traditional approaches. At the same time,\nthe proposed algorithm is able to cut the computational complexity of the traditional algorithm by a 20% factor.\nFurthermore, the estimation of power consumption on a reference architecture, showed that a 20% complexity\nreduction, corresponds to a total power saving of 45%.
Loading....